Speech Features for Discriminating Stress Using Branch and Bound Wrapper Search Mariana Juli˜ao1 , Jorge Silva1 , Ana Aguiar1 , Helena Moniz2,3 , and Fernando Batista2,4 1 Instituto de Telecomunica¸co

Source URL: www.inesc-id.pt

A Finite Branch-and-Bound Algorithm for Nonconvex Quadratic Programming via Semidefinite Programming Samuel Burer1 Dieter Vandenbussche2

Source URL: www.ims.nus.edu.sg

Table of contents Part 1 : Parallel algorithms for combinatorial optimizationParallel branch and bound (T. Crainic, CRT Canada, C. Roucairol, Prism Versaille France, et al.)

Source URL: www.mcs.anl.gov

PDF Document

Source URL: www.zib.de

• Mathematical optimization
• Numerical analysis
• Operations research
• Combinatorial optimization
• Mathematics
• NP-complete problems
• Numerical software
• Column generation
• Linear programming
• SCIP
• Branch and bound
• DantzigWolfe decomposition

An Efficient Branch-and-Bound Algorithm for Optimal Human Pose Estimation Min Sun Murali Telaprolu Honglak Lee Silvio Savarese Department of EECS, University of Michigan, Ann Arbor, MIAbstract

Source URL: web.eecs.umich.edu

Parallel Branch-and-Bound for Two-Stage Stochastic Integer Optimization Akhil Langer‡ , Ramprasad Venkataraman‡ , Udatta Palekar∗ , Laxmikant V. Kale‡ ‡ Department of Computer Science, ∗ College of Business

Source URL: charm.cs.illinois.edu

• Theoretical computer science
• Linear programming
• Mathematical optimization
• Travelling salesman problem
• Stochastic programming
• Search algorithm
• Stochastic optimization
• Sudoku algorithms
• Operations research
• Mathematics
• Applied mathematics

In Search of a Scalable, Parallel Branch-and-Bound for Two-Stage Stochastic Integer Optimization Akhil Langer‡ , Ramprasad Venkataraman‡ , Udatta Palekar∗ , Laxmikant V. Kale‡ ‡ Department of Computer Science,

Source URL: charm.cs.illinois.edu

• Graph connectivity
• Graph theory
• Convex optimization
• Linear programming
• Operations research
• Path
• Degree
• Breadth-first search
• Mathematics
• Theoretical computer science
• Applied mathematics

Finding Most Likely Haplotypes in General Pedigrees through Parallel Branch and Bound Search Rina Dechter, UC Irvine (joint work with Lars Otten)

Source URL: www.ics.uci.edu

• Population genetics
• Genetic genealogy
• Haplotype
• Maximum likelihood
• Bayesian network
• Genetics
• Classical genetics
• Statistics

A Branch-and-cut Algorithm for Integer Bilevel Linear Programs S.T. DeNegre∗ T.K Ralphs †

Source URL: coral.ie.lehigh.edu

• Operations research
• Combinatorial optimization
• Convex optimization
• Linear programming
• Bilevel program
• Branch and cut
• Cutting-plane method
• Branch and bound
• Duality
• Mathematical optimization
• Mathematics
• Applied mathematics